Lookahead Search-Based Low-Complexity Multi-Type Tree Pruning Method for Versatile Video Coding (VVC) Intra Coding
نویسندگان
چکیده
The latest versatile video coding (VVC) introduces some novel techniques such as quadtree with nested multi-type tree (QTMT), multiple transform selection (MTS) and reference line (MRL). These tools improve compression efficiency compared the previous standard H.265/HEVC, but they suffer from very high computational complexity. One of most time-consuming parts VVC intra is unit (CTU) structure decision. In this paper, we propose a low-complexity (MT) pruning method for coding. This consists lookahead search MT pruning. process performed to derive approximate rate-distortion (RD) cost each node at depth 2 or 3. Subsequently, improbable nodes are pruned by different strategies under errors. designed according priority node. Experimental results show that overall proposed algorithm can achieve 47.15% time saving only 0.93% Bjøntegaard delta bit rate (BDBR) increase over natural scene sequences, 45.39% 1.55% BDBR screen content software VTM 10.0. Such demonstrate our achieves good trade-off between complexity quality recent methods.
منابع مشابه
Fast coding unit decision method based on coding tree pruning for high efficiency video coding
A fast coding unit (CU) decision method is proposed for high efficiency video coding (HEVC) by determining early the CU sizes based on coding tree pruning. One of the most effective, a newly introduced concept in HEVC, is variable CU size. In determining the best CU size, the reference encoder of the HEVC tests every possible CU size in order to estimate the coding performance of each CU define...
متن کاملLow Complexity Intra Video Coding Using Transform Domain Prediction
In this paper, a new low complexity intra coding framework is presented. The proposed method is extremely computationally efficient as it uses intra prediction in the DCT domain. To facilitate finding a good predictor, we propose to extend the number of neighouring blocks to be searched, based on a consideration of the type of edges we can expect to observe in the pixel data. The best predictor...
متن کاملOn The Complexity of Optimal Tree Pruning for Source Coding
Tree-structured vector quantization (VQ) is a technique to represent a codebook that simplifies encoding as well as quantizer design. Most design algorithms for tree-structured VQ used in the past are based on heuristics that successively partition the input space. Recently, Chou, Lookabaugh, and Gray proposed a tree pruning heuristic in which a given initial tree is pruned backwards according ...
متن کاملLow Complexity Video Coding for Teleconferencing
We describe a video compression system suitable for teleconferencing applications based on Hierarchical Table-Lookup Vector Quantization and Variable Length Inter-Block Noiseless Coding (VL-IBNC). We apply IBNC selectively to utilize both the inter-frame and intraframe correlation in the video signal. This structure has low encoding and decoding complexity and low bit-rate performance comparabl...
متن کاملLookahead Search for Lossy Context-Based Adaptive Entropy Coding
In this paper we motivate the need for lookahead search in a context based entropy coder. An efficient algorithm based on modeling of the context coder as a finite state machine is presented. A key contribution of this paper is the use of the per survivor processing principle (PSP) to enable a lookahead search in scenarios where adaptive entropy coding is used. Our results show that lookahead s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2023
ISSN: ['1745-1337', '0916-8508']
DOI: https://doi.org/10.1587/transfun.2022eap1022